The Graver Complexity of Integer Programming
نویسندگان
چکیده
منابع مشابه
The Graver Complexity of Integer Programming
Yael Berstein Shmuel Onn Abstract In this article we establish an exponential lower bound on the Graver complexity of integer programs. This provides new type of evidence supporting the presumable intractability of integer programming. Specifically, we show that the Graver complexity of the incidence matrix of the complete bipartite graph K3,m satisfies g(m) = Ω(2 ), with g(m) ≥ 17 ·2−7 for eve...
متن کاملOn the Complexity of Quantified Integer Programming
Quantified integer programming is the problem of deciding assertions of the form Qkxk . . . ∀x2 ∃x1 : A·x ≥ c where vectors of variables xk, . . . ,x1 form the vector x, all variables are interpreted over N (alternatively, over Z), and A and c are a matrix and vector over Z of appropriate sizes. We show in this paper that quantified integer programming with alternation depth k is complete for t...
متن کاملConvex integer maximization via Graver bases
We present a new algebraic algorithmic scheme to solve convex integer maximization problems of the following form, where c is a convex function on R and w1x, . . . , wdx are linear forms on R, max {c(w1x, . . . , wdx) : Ax = b, x ∈ N} . This method works for arbitrary input data A, b, d, w1, . . . , wd, c. Moreover, for fixed d and several important classes of programs in variable dimension, we...
متن کاملComplexity of Primal Methods in Integer Programming
One common approach to solve optimization problems is the primal method. One starts with a feasible point and then successively produces new feasible solutions with better objective function values until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration, i.e., given a feasible point find an augmenting vector, if one exists. The d...
متن کاملthe effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing
بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Combinatorics
سال: 2009
ISSN: 0218-0006,0219-3094
DOI: 10.1007/s00026-009-0029-6